An Explicit Bijection Between Semistandard Tableaux and Non-Elliptic sl3 Webs
نویسندگان
چکیده
The sl3 spider is a diagrammatic category used to study the representation theory of the quantum group Uq(sl3). The morphisms in this category are generated by a basis of non-elliptic webs. KhovanovKuperberg observed that non-elliptic webs are indexed by semistandard Young tableaux. They establish this bijection via a recursive growth algorithm. Recently, Tymoczko gave a simple version of this bijection in the case that the tableaux are standard and used it to study rotation and joins of webs. We build on Tymoczko’s bijection to give a simple and explicit algorithm for constructing all non-elliptic sl3 webs.
منابع مشابه
The Combinatorics of A2-webs
The nonelliptic A2-webs with k “+”s on the top boundary and 3n − 2k “−”s on the bottom boundary combinatorially model the space Homsl3(V,V) of sl3-module maps on tensor powers of the natural 3-dimensional sl3-module V, and they have connections with the combinatorics of Springer varieties. Petersen, Pylyavskyy, and Rhodes showed that the set of such A2-webs and the set of semistandard tableaux ...
متن کاملA simple bijection between standard 3 × n tableaux and irreducible webs for sl 3
Combinatorial spiders are a model for the invariant space of the tensor product of representations. The basic objects, webs, are certain directed planar graphs with boundary; algebraic operations on representations correspond to graph-theoretic operations on webs. Kuperberg developed spiders for rank 2 Lie algebras and sl2. Building on a result of Kuperberg, Khovanov–Kuperberg found a recursive...
متن کاملJeu-de-taquin promotion and a cyclic sieving phenomenon for semistandard hook tableaux
Jeu-de-taquin promotion yields a bijection on the set of semistandard λ-tableaux with entries bounded by k. In this note, we determine the order of jeu-de-taquin promotion on the set of semistandard hook tableaux CST ((n−m, 1m), k), with entries bounded by k, and on the set of semistandard hook tableaux with fixed content α, CST ((n−m, 1m), k, α). We give a bijection between CST ((n−m, 1m), k, ...
متن کاملA 'Nice' Bijection for a Content Formula for Skew Semistandard Young Tableaux
Based on Schützenberger’s evacuation and a modification of jeu de taquin, we give a bijective proof of an identity connecting the generating function of reverse semistandard Young tableaux with bounded entries with the generating function of all semistandard Young tableaux. This solves Exercise 7.102 b of Richard Stanley’s book ‘Enumerative Combinatorics 2’.
متن کاملPermuted Composition Tableaux, 0-hecke Algebra and Labeled Binary Trees
We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our primary motivation for studying permuted composition tableaux is to enumerate all possible ordered pairs of permutations (σ1, σ2) that can be obtained by stand...
متن کامل